First Steps Towards Experimental Design in Evaluating Layout Layout Algorithms: Wire Length versus Wire Crossing in Linear Placement Optimization

نویسندگان

  • Debabrata Ghosh
  • Franc Brglez
  • Matthias Stallmann
چکیده

This report introduces an experimental design that discovers a new relationship between a cell placement for minimized wire crossing in bipartite (two-layer) graphs and a cell placement in linear arrangement, optimized for minimum total wire length as measured after rectilinear routing in a single channel. We introduce hypercrossing, a new crossing model for graphs, and demonstrate that the total wire length in the channel, as measured after routing, has a positive linear correlation with the total hypercrossing, and a coe cient of correlation of near 100%. While heuristics to directly minimize total hypercrossing are yet to be invented, our experiments show that the minimization of total (regular) wire crossing leads to placements with signi cantly reduced wire length and wiring area. A methodology and new datasets are now available to determine, with statistical signi cance, which of the two cost function classes will yield a better placement in general: costs based on the model of the wire length, or costs based on the model of the wire crossing. Our best results to date have been achieved with a wire crossing cost model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Standard Cell Placement Methodology using Hybrid Analytic and Heuristic Techniques

In recent years, size of VLSI circuits is dramatically grown and layout generation of current circuits has become a dominant task in design flow. Standard cell placement is an effective stage of physical design and quality of placement affects directly on the performance, power consumption and signal immunity of design. Placement can be performed analytically or heuristically. Analytical placer...

متن کامل

Discrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement (RESEARCH NOTE)

Placement process is one of the vital stages in physical design. In this stage, modules and elements of circuit are placed in distinct locations according to optimization basis. So that, each placement process tries to influence on one or more optimization factor. In the other hand, it can be told unequivocally that FPGA is one of the most important and applicable devices in our electronic worl...

متن کامل

An Agile Migration Framework for Analog Layout Design

Layout generation in the late analog CMOS design is challenging by its increasing layout constraints and performance requirements. However, iterative refinement on manual design damages the productivity of analog layout. Therefore, it is more efficient to enroll the know-how from existing design instead of generating a new one. To contend with time-consuming analog layout for more possibilities...

متن کامل

Modeling and Layout Optimization of VLSI Devices and Interconnects In Deep Submicron Design

This paper presents an overview of recent advances on modeling and layout optimization of devices and interconnects for high-performance VLSI circuit design under the deep submicron technology. First, we review a number of interconnect and driver/gate delay models, which are most useful to guide the layout optimization. Then, we summarize the available performance optimization techniques for VL...

متن کامل

Node duplication and routing algorithms for quantum-dot cellular automata circuits

Quantum-dot cellular automata (QCA) is a novel computing mechanism that can represent binary information based on the spatial distribution of electron charge configuration in chemical molecules. QCA circuit layout is currently restricted to a single layer with very limited number of wire crossings permitted. Thus, wire crossing minimisation is crucial in improving the manufacturability of QCA c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998